منابع مشابه
Denotational Semantics for Teaching Lazy Functional Programming
If you believe this document infringes copyright then please contact the KAR admin team with the take-down information provided at http://kar.kent.ac.uk/contact.html Citation for published version Chitil, Olaf (1999) Denotational Semantics for Teaching Lazy Functional Programming. In: Proceedings of the Workshop on Functional and Declarative Programming in Education, 29 September 1999, Paris, F...
متن کاملDenotational Versus Declarative Semantics for Functional Programming
Denotational semantics is the usual mathematical semantics for functional programming languages. It is higher order (H.O.) in the sense that the semantic domain D includes D ! D] as a subdomain. On the other hand, the usual declarative semantics for logic programs is rst order (F.O.) and given by the least Herbrand model. In this paper, we take a restricted kind of H.O. conditional rewriting sy...
متن کاملDenotational Semantics and Refinement
Denotational descriptions are frequently presented in terms of a sequence of descriptions of programming languages of increasing complexity. We discuss a formal approach to the study of such description sequences in terms of a refinement relation, showing how the informal use made of this approach in tutorial introductions to denotational semantics may be formally justified.
متن کاملRevisiting Elementary Denotational Semantics
We present a semantics for an applied call-by-value λ-calculus that is compositional, extensional, and elementary. We present four dierent views of the semantics: 1) as a relational (big-step) semantics that is not operational but instead declarative, 2) as a denotational semantics that does not use domain theory, 3) as a non-deterministic interpreter, and 4) as a variant of the intersection t...
متن کاملOperational and Denotational Semantics
The types are , ::= Nat ∣ → . All the terms in the language come with explicit types. In particular, we assume an infinite, countable set of variables of each type , and write x for a variable of type . The terms t of type (in short, t : ) are defined by induction on their size by : – every variable x is of type ; – if N : , then x ⋅N is a term of type → ; – if M : → and N : , then MN is a term...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1983
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/26.2.164